A Neighborhood Expansion Tabu Search Algorithm Based On Genetic Factors
نویسندگان
چکیده
منابع مشابه
A Neighborhood Expansion Tabu Search Algorithm Based On Genetic Factors
We provide an improved algorithm called “a neighborhood expansion tabu search algorithm based on genetic factors” (NETS) to solve traveling salesman problem. The algorithm keeps the traditional tabu algorithm’s neighborhood, ensure the algorithm’s strong climbing ability and go to the local optimization. At the same time, introduce the genetic algorithm’s genetic factor (crossover factor and va...
متن کاملTabu-KM: A Hybrid Clustering Algorithm Based on Tabu Search Approach
The clustering problem under the criterion of minimum sum of squares is a non-convex and non-linear program, which possesses many locally optimal values, resulting that its solution often falls into these trap and therefore cannot converge to global optima solution. In this paper, an efficient hybrid optimization algorithm is developed for solving this problem, called Tabu-KM. It gathers the ...
متن کاملSimulated Evolution based Hybrids for Genetic Algorithm and Tabu Search
In this paper, Simulated Evolution based goodness attributes are incorporated into Tabu Search and Genetic Algorithms to enhance performance as compared to canonical strategies. In TS, the goodness is used in generating the candidate list of neighboring solutions. In GA, allele fitness is used to define a new crossover which significantly improves over traditional recombination strategies. Both...
متن کاملInteractive Tabu Search vs. Interactive Genetic Algorithm
We propose an interactive tabu search (ITS) to be used for the development support of a product that fits a human’s feeling. Interactive evolutionary computation (IEC) is one of the technologies used in the development support of products that fit a human’s feeling using a computer and person undergoing a communication. The interactive generic algorithm (IGA) is generally used in the IEC. A maj...
متن کاملMultiple constraints QoS multicast routing optimization algorithm based on Genetic Tabu Search Algorithm
With the fast evolution of real time and multimedia applications, some quality of service (QoS) constraints need to be guaranteed in the underlying network. In this paper, we present a new method for least-cost QoS multicast routing problem based on genetic algorithm and tabu search. This problem has been proven to be NP-complete. The proposed genetic tabu search algorithm (GTS) combine Genetic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Open Journal of Social Sciences
سال: 2016
ISSN: 2327-5952,2327-5960
DOI: 10.4236/jss.2016.43037